Sign Pattern Matrices that Admit P0 Matrices
نویسنده
چکیده
A P0-matrix is a real square matrix all of whose principle minors are nonnegative. In this paper, we consider the class of P0-matrix. Our main aim is to determine which sign pattern matrices are admissible for this class of real matrices. Keywords—Sign pattern matrices, P0 matrices, graph, digraph
منابع مشابه
The asymptotics of Wilkinson’s shift iteration
We study the rate of convergence of Wilkinson’s shift iteration acting on Jacobi matrices with simple spectrum. We show that for AP-free spectra (i.e., simple spectra containing no arithmetic progression with 3 terms), convergence is cubic. In order 3, there exists a tridiagonal symmetric matrix P0 which is the limit of a sequence of a Wilkinson iteration, with the additional property that all ...
متن کاملNew inverse data for tridiagonal matrices and the asymptotics of Wilkinson’s shift iteration
We introduce bidiagonal coordinates, a new set of spectral coordinates on open dense charts covering the space of real symmetric tridiagonal matrices. In contrast to the standard Jacobi inverse variables, reduced tridiagonal matrices now lie in the interior of some chart. Bidiagonal coordinates are thus convenient for the study of asymptotics of isospectral dynamics, both for continuous and dis...
متن کاملPattern Avoidance in Alternating Sign Matrices
We generalize the definition of a pattern from permutations to alternating sign matrices. The number of alternating sign matrices avoiding 132 is proved to be counted by the large Schröder numbers, 1, 2, 6, 22, 90, 394 . . .. We give a bijection between 132-avoiding alternating sign matrices and Schröder-paths, which gives a refined enumeration. We also show that the 132, 123avoiding alternatin...
متن کاملLinear and Multilinear Algebra
This article may be used for research, teaching and private study purposes. Any substantial or systematic reproduction, redistribution , reselling , loan or sub-licensing, systematic supply or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to da...
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کامل